Cramer-Rao bounds for discrete-time nonlinear filtering problems
نویسندگان
چکیده
منابع مشابه
Posterior Cramer-Rao bounds for discrete-time nonlinear filtering
A mean-square error lower bound for the discretetime nonlinear filtering problem is derived based on the Van Trees (posterior) version of the Cramér–Rao inequality. This lower bound is applicable to multidimensional nonlinear, possibly non-Gaussian, dynamical systems and is more general than the previous bounds in the literature. The case of singular conditional distribution of the one-step-ahe...
متن کاملNote for Cramer-Rao Bounds
• (z)r and (z)i denote the real and imaginary part of z. II. CONSTRAINED CRAMER-RAO BOUND A. Problem Statement Problem statement and notation are based on [1]. • a: a K × 1 non-random vector which are to be estimated. • r: an observation of a random vector . • â (R): an estimate of a basing on the observed vector r . It is required that â (R) satisfies M nonlinear equality constraints (M < K), ...
متن کاملCramer-Rao bounds for parametric shape estimation in inverse problems
We address the problem of computing fundamental performance bounds for estimation of object boundaries from noisy measurements in inverse problems, when the boundaries are parameterized by a finite number of unknown variables. Our model applies to multiple unknown objects, each with its own unknown gray level, or color, and boundary parameterization, on an arbitrary known background. While such...
متن کاملA fresh look at Bayesian Cramér-Rao bounds for discrete-time nonlinear filtering
In this paper, we aim to relate different Bayesian Cramér-Rao bounds which appear in the discrete-time nonlinear filtering literature in a single framework. A comparative theoretical analysis of the bounds is provided in order to relate their tightness. The results can be used to provide a lower bound on the mean square error in nonlinear filtering. The findings are illustrated and verified by ...
متن کاملComputing Constrained Cramer Rao Bounds
We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1995
ISSN: 0018-9286
DOI: 10.1109/9.402242